Temporal skeletons for verifying time

Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons

Astract. We present a method of constructing concurrent programs in which the synchronization skeleton of the program is automatically synthesized from a (branching time) temporal logic specification. The synthesis method uses a decision procedure based on the finite model property of the logic to determine satisfiability of the specification formula f. If f is satisfiable, then a model for f w...

Dynamic run time support for skeletons

Verifying Temporal Properties of Processes

1 Motivation Many interesting concurrent systems have innnite state spaces: examples include concurrent while programs; Petri Nets; CCS (or CSP) processes with value passing. All of these examples can be interpreted operationally as innnite labelled transition systems, structures of the form (P; f a ?! : a 2 L g) where P is a set of points (states, markings, processes) and a ?! the appropriate ...

ASADAL/PROVER: A Toolset for Verifying Temporal Properties of Real-Time System Specifications in Statechart

Critical properties of real-time embedded systems must be verified before these systems are deployed as failing to meet these properties may cause considerable property damages and/or human casualties. Although Statechart is one of the most popular languages for modeling behavior of real-time systems, proof systems [5], [9], [14] and analysis tools [1], [2] for Statechart so far are in research...

Agent-based Abstractions for Verifying Alternating-time Temporal Logic with Imperfect Information

We introduce a 3-valued abstraction technique for alternatingtime temporal logic (ATL) in contexts of imperfect information. We introduce underand over-approximations of an agent’s strategic abilities in terms of mustand maystrategies and provide a 3-valued semantics for ATL based on agents in interpreted systems (IS). We define a relation of simulation between the agents and prove that it pres...